Pointed binary encompassing trees: Simple and optimal
نویسندگان
چکیده
منابع مشابه
Pointed binary encompassing trees: Simple and optimal
For n disjoint line segments in the plane we construct in optimal O(n log n) time an encompassing tree of maximal degree three such that every vertex is pointed. Moreover, at every segment endpoint all incident edges lie in a halfplane defined by the incident input segment.
متن کاملPointed Binary Encompassing Trees
We show that for any set of disjoint line segments in the plane there exists a pointed binary encompassing tree T , that is, a spanning tree on the segment endpoints that contains all input segments, has maximum degree three, and every vertex v ∈ T is pointed, that is, v has an incident angle greater than π. Such a tree can be completed to a minimum pseudo-triangulation. In particular, it follo...
متن کاملPointed Encompassing Trees
It is shown that for any set of disjoint line segments in the plane there exists a pointed binary encompassing tree, that is, a spanning tree on the segment endpoints that contains all input segments, has maximal degree three, and such that every vertex is incident to an angle greater than π. As a consequence, it follows that every set of disjoint line segments has a bounded degree pseudo-trian...
متن کاملCatalan numbers, binary trees, and pointed pseudotriangulations
We study connections among structures in commutative algebra, combinatorics, and discrete geometry, introducing an array of numbers, called Borel’s triangle, that arises in counting objects in each area. By defining natural combinatorial bijections between the sets, we prove that Borel’s triangle counts the Betti numbers of certain Borel-fixed ideals, the number of binary trees on a fixed numbe...
متن کاملOptimal Binary Search Trees
An optimal binary search tree is a binary search tree for which the nodes are arranged on levels such that the tree cost is minimum. For the purpose of a better presentation of optimal binary search trees, we will consider “extended binary search trees”, which have the keys stored at their internal nodes. Suppose “n” keys k1, k2, ... , k n are stored at the internal nodes of a binary search tre...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Geometry
سال: 2010
ISSN: 0925-7721
DOI: 10.1016/j.comgeo.2006.12.005